Listar por tema 

Listar por tema "combinatorial optimization"

Mostrando ítems 1-2 de 2

    • Golden Ball Algorithm for solving Flow Shop Scheduling Problem 

      Sayoti, Fatima; Essaid Riffi, Mohammed (International Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI), 09/2016)
      The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called ...

    • Hybrid Algorithm for Solving the Quadratic Assignment Problem 

      Sayoti, Fatima; Riffi, Mohammed Essaid (International Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI), 03/2019)
      The Quadratic Assignment Problem (QAP) is a combinatorial optimization problem; it belongs to the class of NP-hard problems. This problem is applied in various fields such as hospital layout, scheduling parallel production ...